Sharp Lagrange multipliers for set-valued optimization problems
نویسندگان
چکیده
In this paper, we give a comparison between some notions of weak sharp minima introduced in [5,15,43] for set-valued optimization problems. Besides, establish Lagrange multiplier rules general constrained problems involving new scalarization functionals based on the oriented distance. Moreover, provide sufficient optimality conditions considered without any convexity assumptions.
منابع مشابه
Lagrange multipliers for set - valued optimization problems associated with coderivatives ✩
In this paper we investigate a vector optimization problem (P) where objective and constraints are given by set-valued maps. We show that by mean of marginal functions and suitable scalarizing functions one can characterize certain solutions of (P) as solutions of a scalar optimization problem (SP) with single-valued objective and constraint functions. Then applying some classical or recent res...
متن کاملWeak Sharp Minima in Set-Valued Optimization Problems
and Applied Analysis 3 x0, y0 ∈ L StrD F, S resp., x0, y0 ∈ LW MinD F, S , if there exists a neighborhood U of x0 in X such that y0 ∈ StrD F U ∩ S ( resp., y0 ∈ W minD F U ∩ S ) , that is, ∀x ∈ S∩U, F x − y0 ∩ −D\{0} ∅ resp. ∀x ∈ S∩U, F x − y0 ∩ − intD ∅. 2.4 We will say that x0, y0 is a global strict global weak minimizers when U X. The set of all global strict minimizers resp., weak minimizer...
متن کاملLower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2022
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2022034